Solving hybrid-vehicle routing problem using modified simulated annealing

<span lang="EN-US">In this paper, we consider the hybrid vehicle routing problem (HVRP) at which consumes two types of power: fuel and electricity. The aim is to minimize total cost travelling between customers, provided that each customer visited only once. departs from depot returns after completing whole route. This optimization solved using a modified simulated annealing (SA) heuristic procedure with constant temperature. approach implemented on numerical example results are compared SA algorithm decreasing obtained show temperature overrides indicate needs twice number iterations needed by reach near optimum solution.</span>